Autoepistemic Logic and Introspective Circumscription
نویسندگان
چکیده
We investigate the relationship between two epistemic nonmonotonic formalisms: autoepistemic logic and introspective circumscription. Finitely axiomatized autoepistemic theories are shown to be equivalent to the propositional case of introspective circumscription. This theorem is applied to the problem of relating the usual "minimizing" circumscription to autoepistemic logic.
منابع مشابه
On Stratified Autoepistemic Theories
In this paper we investigate some properties of "autoepistemic logic" approach to the formalization of common sense reasoning suggested by R. Moore in [Moore, 19851. In particular we present a class of autoepistemic theories (called stratified autoepistemic theories) and prove that theories from this class have unique stable autoepistemic expansions and hence a clear notion of "theoremhood". Th...
متن کاملLogic Program Semantics and Circumscription of Autoepistemic Theories
In this paper we rst demonstrate that all three prominent semantics for logic programs can be redeened in terms of alternating xpoints of the Gelfond-Lifschitz transformation , and then show that the three semantics can be characterized by circumscription of autoepistemic theories.
متن کاملMinimal Well-founded Semantics and Autoepistemic Circumscription
In this paper we propose the minimal well-founded semantics for logic programs with negation based on the xpoint of the double Gelfond-Lifschitz transformation which overcomes the existing problems associated with the stable, the well-founded, and the stable class semantics. By representing logic programs as autoepistemic theories, we are able to represent various semantics as simple circumscri...
متن کاملEliminating the Fixed Predicates from a Circumscription
Parallel predicate circumscription is the primary circumscriptive technique used in formalizing commonsense reasoning. In this paper we present a direct syntactic construction for transforming any parallel predicate circumscription using fixed predicates into an equivalent one which does not. Thus, we show that predicate circumscription is no iiiore expressive with fixed predicates than without...
متن کاملReasoning about Minimal Belief and Negation as
We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994